Adder MAC and estimates for Rényi entropy
نویسندگان
چکیده
This paper discusses a possible program for improving the outer (converse) bounds on the finite-blocklength performance of multiple-access codes. The program is based on a certain conjecture involving Rényi entropy of a sum of two independent binary vectors. Some partial results towards showing the conjecture are presented. The problem of bounding the joint Rényi entropy in terms of the marginal entropies is addressed.
منابع مشابه
A Preferred Definition of Conditional Rényi Entropy
The Rényi entropy is a generalization of Shannon entropy to a one-parameter family of entropies. Tsallis entropy too is a generalization of Shannon entropy. The measure for Tsallis entropy is non-logarithmic. After the introduction of Shannon entropy , the conditional Shannon entropy was derived and its properties became known. Also, for Tsallis entropy, the conditional entropy was introduced a...
متن کاملThe Rate of Rényi Entropy for Irreducible Markov Chains
In this paper, we obtain the Rényi entropy rate for irreducible-aperiodic Markov chains with countable state space, using the theory of countable nonnegative matrices. We also obtain the bound for the rate of Rényi entropy of an irreducible Markov chain. Finally, we show that the bound for the Rényi entropy rate is the Shannon entropy rate.
متن کاملOn the entropy power inequality for the Rényi entropy of order [0, 1]
Using a sharp version of the reverse Young inequality, and a Rényi entropy comparison result due to Fradelizi, Madiman, and Wang, the authors are able to derive a Rényi entropy power inequality for log-concave random vectors when Rényi parameters belong to (0, 1). Furthermore, the estimates are shown to be somewhat sharp.
متن کاملRényi Entropy , Guesswork Moments and Large Deviations C - E Pfister and WG Sullivan
For a large class of stationary probability measures on AN, where A is a finite alphabet, we compute the specific Rényi entropy of order α and the specific guesswork moments of order β > −1. We show that the specific guesswork moment of order β equals the specific Rényi entropy of order α = 1/(1+ β) multiplied by β. The method is based on energy–entropy estimates suggested by statistical physic...
متن کاملEstimation of entropy rate and Rényi entropy rate for Markov chains
Estimation of the entropy rate of a stochastic process with unknown statistics, from a single sample path is a classical problem in information theory. While universal estimators for general families of processes exist, the estimates have not been accompanied by guarantees for fixed-length sample paths. We provide finite sample bounds on the convergence of a plug-in type estimator for the entro...
متن کامل